Decidability of Split Equivalence

Decidability of Split Equivalence

We show that the following problem is decidable: given expressions E1 and E2 constructed from variables by the regular operations and shuffle, is the identity E1 = E2 true for all instantiations of its variables by strings? Our proof uses the notations developed in the causal approach to concurrency. As a byproduct we obtain decidability of similar equivalence for other formalisms. In particula...

Decidability of DPDA equivalence

A proof of decidability of equivalence between deterministic pushdown automata is presented using a mixture of methods developed in concurrency and language theory. The technique appeals to a tableau proof system for equivalence of configurations of strict deterministic grammars.

An Introduction to Decidability of DPDA Equivalence

Decidability of Bisimulation Equivalence for Pushdown Processes

We show that bisimulation equivalence is decidable for pushdown automata without ǫ-transitions.

Decidability of Interval Temporal Logics over Split-Frames via Granularity

Logics for time intervals provide a natural framework for representing and reasoning about timing properties in various areas of artificial intelligence and computer science. Unfortunately, most interval temporal logics proposed in the literature have been shown to be (highly) undecidable. Decidable fragments of these logics have been obtained by imposing severe restrictions on their expressive...